Lexicographic Beliefs and Assumption∗ Eddie Dekel† Amanda Friedenberg‡ Marciano Siniscalchi§

Source URL: www.public.asu.edu

• Measure theory
• Probability theory
• Boolean algebra
• Sigma-algebra
• Measure
• Determinacy
• Model theory

Frozen variables in random boolean constraint satisfaction problems Michael Molloy and Ricardo Restrepo Department of Computer Science, University of Toronto 10 King’s College Road, Toronto, ON July 3, 2012

Source URL: www.cs.toronto.edu

• Constraint programming
• Constraint satisfaction problem
• Structure
• Hypergraph
• Model theory

Controlling Boolean Logic and DHCP Ike Antkare International Institute of Technology United Slates of Earth

Source URL: membres-lig.imag.fr

• Actor model
• Concurrent computing
• Dwight D. Eisenhower
• Ike
• Stan

Solving Exists/Forall Problems With Yices Extended Abstract Bruno Dutertre Computer Science Laboratory SRI International

Source URL: yices.csl.sri.com

• Model theory
• Logic in computer science
• Semantics
• Formal languages
• Logical truth
• Satisfiability modulo theories
• Interpretation
• Quantifier elimination
• True quantified Boolean formula
• Quantifier
• Substitution
• Well-formed formula

Low-level dichotomy for Quantified Constraint Satisfaction Problems Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.K.

Source URL: www.bedewell.com

• Model theory
• Constraint programming
• Logical truth
• Mathematical logic
• Formal languages
• Structure
• Interpretation
• Satisfiability
• Substitution
• Constraint satisfaction problem
• Complexity of constraint satisfaction
• Boolean satisfiability problem

STABLE CANONICAL RULES GURAM BEZHANISHVILI, NICK BEZHANISHVILI, ROSALIE IEMHOFF Abstract. We introduce stable canonical rules and prove that each normal modal rule system is axiomatizable by stable canonical rules. This

Source URL: www.phil.uu.nl

• Modal logic
• Non-classical logic
• Model theory
• Boolean algebra
• Philosophical logic
• Kripke semantics
• Interior algebra
• Heyting algebra
• Embedding
• Intermediate logic
• Normal modal logic
• Substitution

ARTIFICIAL INTELLIGENCE 71 Probabilistic Logic* Nils J . N i l s s o n

Source URL: ai.stanford.edu

• Model theory
• Non-classical logic
• Probability and statistics
• Boolean algebra
• Predicate logic
• Probabilistic logic
• Modal logic
• First-order logic
• Probability
• Interpretation
• Inductive probability
• Vector logic

The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

Source URL: ludovicpatey.com

• Logic
• Mathematics
• Constraint programming
• Abstraction
• Model theory
• Boolean satisfiability problem
• Electronic design automation
• Logic in computer science
• Complexity of constraint satisfaction
• Constraint satisfaction problem
• Satisfiability
• Binary relation

Remark on the history of Boolean models September 14, 2013 Introduction In [4], D. Scott refers to an early presentation of Boolean-valued model, due to P. Lagerstr¨om, which is described in [2]. What is presented howev

Source URL: www.cse.chalmers.se

Vaught’s Conjecture and Boolean Algebras Asher M. Kach (Joint with Steffen Lempp) Victoria University of Wellington and University of Connecticut BLAST 2010

Source URL: spot.colorado.edu

• Model theory
• Boolean algebra
• Forcing
• Logic
• Mathematics
• Abstraction
• Complete Boolean algebra
• Order theory
• Conjectures
• Stable theory